Resultaten visas 1 - 10 / 124
resultat / per sida
Vilka publikationsuppgifter finns i tjänsten?
Publikationens namn
Upphovspersoner
Publikationskanal
År

Grid based propositional satisfiability solving

Öppen tillgång
Hyvärinen, Antti E. J.
Aalto University2011

A System for Distributed Propositional Satisfiability Checking in Computational Grids

Hyvärinen, Antti E.J.
-2006

A Compact Reformulation of Propositional Satisfiability as Binary Constraint Satisfaction

Referentgranskad
Järvisalo, Matti; Niemelä, Ilkka
-2004

Parallel encodings of classical planning as satisfiability

Rintanen, Jussi; Heljanko, Keijo; Niemelä, Ilkka
Freiburg University2004

Parallel Encodings of Classical Planning as Satisfiability

Referentgranskad
DOI
10.1007/978-3-540-30227-8_27
Rintanen, Jussi; Niemelä, Ilkka; Heljanko, Keijo
Lecture Notes in Computer Science2004

Efficient Satisfiability Modulo Theories via Delayed Theory Combination

Referentgranskad
Bozzano, Marco; Bruttomesso, Roberto; Cimatti, Alessandro; Junttila, Tommi; Ranise, Silvio; van Ross...
SPRINGER2005

Planning as Satisfiability Parallel Plans and Algorithms for Plan Search

Rintanen, Jussi; Heljanko, Keijo; Niemelä, Ilkka
Albert-Ludwigs-Universität Freiburg2004

Incremental Satisfiability Solving and its Applications

Öppen tillgång
Wieringa, Siert
Aalto University2014

Propositional team logics

Referentgranskad
Öppen tillgång
DOI
10.1016/j.apal.2017.01.007
Yang, Fan; Väänänen, Jouko
Annals of Pure and Applied Logic2017

Complexity of Propositional Logics in Team Semantic

Referentgranskad
Öppen tillgång
DOI
10.1145/3157054
Hannula, Miika; Kontinen, Juha; Virtema, Jonni; Vollmer, Heribert
ACM Transactions on Computational Logic2018

Grid based propositional satisfiability solving

Öppen tillgång
2011

A System for Distributed Propositional Satisfiability Checking in Computational Grids

2006

A Compact Reformulation of Propositional Satisfiability as Binary Constraint Satisfaction

Referentgranskad
2004

Parallel encodings of classical planning as satisfiability

2004

Parallel Encodings of Classical Planning as Satisfiability

Referentgranskad
DOI
10.1007/978-3-540-30227-8_27
2004

Efficient Satisfiability Modulo Theories via Delayed Theory Combination

Referentgranskad
2005

Planning as Satisfiability Parallel Plans and Algorithms for Plan Search

2004

Incremental Satisfiability Solving and its Applications

Öppen tillgång
2014

Propositional team logics

Referentgranskad
Öppen tillgång
DOI
10.1016/j.apal.2017.01.007
2017

Complexity of Propositional Logics in Team Semantic

Referentgranskad
Öppen tillgång
DOI
10.1145/3157054
2018